Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions
نویسندگان
چکیده
منابع مشابه
Stochastic Scheduled Service Network Design: The Value of Deterministic Solutions
We study the value and quality of deterministic solutions to scheduled stochastic capacitated multi-commodity service network design problems. We study both the fixed and variable (integer and continuous) capacity cases, and investigate models with and without asset-balance constraints. For the deterministic cases, we replace the random variables in the stochastic model with the 50 th and the 7...
متن کاملScheduled Service Network Design for Freight Rail Transportation
The paper addresses the scheduled service network design problem for freight rail transportation. The proposed model integrates service selection and scheduling, car classification and blocking, train make up, and routing of time-dependent customer shipments, based on a cyclic three-layer space-time network representation of the associated operations and decisions, their relations and time dime...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
Stochastic Transportation-Inventory Network Design Problem
In this paper, we study the stochastic transportation-inventory network design problem involving one supplier and multiple retailers. Each retailer faces some uncertain demand. Due to this uncertainty, some amount of safety stock must be maintained to achieve suitable service levels. However, risk-pooling benefits may be achieved by allowing some retailers to serve as distribution centers (and ...
متن کاملTime-dependent Stochastic Shortest Path(s) Algorithms for a Scheduled Transportation Network
Following on from our work concerning travellers’ preferences in public transportation networks (Wu and Hartley, 2004), we introduce the concept of stochasticity to our algorithms. Stochasticity greatly increases the complexity of the route finding problem, so greater algorithmic efficiency becomes imperative. Public transportation networks (buses, trains) have two important features: edges can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2019
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.2018.0819